Sampling weighted perfect matchings on the square-octagon lattice
نویسندگان
چکیده
منابع مشابه
Sampling Weighted Perfect Matchings on the Square-Octagon Lattice
We consider perfect matchings of the square-octagon lattice, also known as “fortresses” [16]. There is a natural local Markov chain on the set of perfect matchings that is known to be ergodic. However, unlike Markov chains for sampling perfect matchings on the square and hexagonal lattices, corresponding to domino and lozenge tilings, respectively, the seemingly related Markov chain on the squa...
متن کاملQuantum magnetic phase transition in square-octagon lattice
Quantum magnetic phase transition in square-octagon lattice was investigated by cellular dynamical mean field theory combining with continuous time quantum Monte Carlo algorithm. Based on the systematic calculation on the density of states, the double occupancy and the Fermi surface evolution of square-octagon lattice, we presented the phase diagrams of this splendid many particle system. The c...
متن کامل0 Trees and Matchings Richard
In this article, Temperley’s bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed (and undirected) graphs, where edges carry nonnegative weights that induce a weighting on the set of spanning trees. We show that the weighted, directed spann...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملEquivalence classes of matchings and lattice-square designs
We enumerate nonisomorphic lattice-square designs yielded by a conventional construction. Constructed designs are speci3ed by words composed from 3nite-3eld elements. These words are permuted by the isomorphism group in question. The latter group contains a direct-product subgroup, acting, respectively, upon the positions and identities of the 3nite-3eld elements. We review enumeration theory f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.01.014